Analysis and Heuristic Scheduling for Periodic Messages in Ff System
نویسندگان
چکیده
The remote periodic message not only has timing constraints but also often has precedence constrains in Foundation Fieldbus system. In this paper, analysis and heuristic scheduling for remote periodic messages are proposed. Firstly, precedence constrains are considered and described by modifying release times and deadlines of remote periodic messages. Secondly, a heuristic algorithm for building FF schedule time list is proposed to find acceptable scheduling solutions by some simple strategies in order to meet these messages’ timing constraints. Finally, an example of application shows the process of building FF schedule time list. Copyright©2002 IFAC
منابع مشابه
Minimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملA MULTI-OBJECTIVE DECENTRALIZED MULTIPLE CONSTRUCTION PROJECTS SCHEDULING PROBLEM CONSIDERING PERIODIC SERVICES AND ORDERING POLICIES
In decentralized construction projects, costs are mostly related to investment, material, holding, logistics, and other minor costs for implementation. For this reason, simultaneous planning of these items and appropriate scheduling of activities can significantly reduce the total costs of the project undertaken. This paper investigates the decentralized multiple construction projects schedulin...
متن کاملThe Case for Fair Multiprocessor Scheduling
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; this is mainly due to the fact that well-understood uniprocessor scheduling algorithms can be used on each processor. In recent years, global-scheduling algorithms based on the concept of “proportionate fairness” (Pfair...
متن کاملScheduling of multimedia traffic for continuous media in packet-switched networks
Many of multimedia applications in distributed systems should transmit continuous audio/video across networks when clients request. Typically, messages for continuous media in packet-switched networks are split into periodic, different sized packets with deadlines. Since clients request different typed services, traffic streams are heterogeneous. Furthermore, since the continuity of continuous ...
متن کاملA New Hybrid Heuristic Technique for Unit Commitment and Generation Scheduling
This paper proposes a novel technique for solving generation scheduling and ramp rate constrained unit commitment. A modified objective function associated with a new start-up cost term is introduced in this paper. The proposed method is used to solve generating scheduling problem satisfying SRR, minimum up and down time as well as ramp rate constraints. Two case studies are conducted to imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002